Polynomial representations of the Lucas logarithm
نویسندگان
چکیده
We deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bounds on the degree of interpolation polynomials of the Lucas logarithm for subsets of given data. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
The Lucas function is a recently proposed one-way function used in public key cryptography. The security of cryptosystems based on the Lucas function relies on the difficulty of solving the Lucas logarithm problem. In this paper, the Lucas logarithm problem is studied using interpolation techniques. In particular, the inverse Aitken and the inverse Neville interpolation methods are applied to v...
متن کاملThe Discrete Logarithm Problem for LucasSequences and a New Class of Weak
Let n be an RSA modulus, that is, n = pq, where p, q are two large primes. We deene the discrete logarithm problem for Lucas sequences and show that solving the discrete logarithm problem for Lucas sequences modulo n gives a polynomial factorisation algorithm. Let d = jq?pj. We calculate m and Vd(m; 1) mod n in polynomial time and then solve for d in O(~ d 1 2 +) time where ~ d is an upper esti...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملRecognising the small Ree groups in their natural representations
We present Las Vegas algorithms for constructive recognition and constructive membership testing of the Ree groups G2(q) = Ree(q), where q = 3 for some m > 0, in their natural representations of degree 7. The input is a generating set X ⊂ GL(7, q). The constructive recognition algorithm is polynomial time given a discrete logarithm oracle. The constructive membership testing consists of a prepr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 12 شماره
صفحات -
تاریخ انتشار 2006